On the Convergence of the Preconditioned Group Rotated Iterative Methods In The Solution of Elliptic PDEs
نویسندگان
چکیده
The convergence rates of the explicit group methods derived from the standard and skewed (rotated) finite difference operators depend on the spectral properties of the coefficient matrices resulted from these group discretization formulas. By applying appropriate preconditioner, we may transform the resulting linear system into another equivalent system that has the same solution, but has a better spectral property than its unpreconditioned form. In Saeed and Ali [11], the application of a specific splittingtype block preconditioner to the Explicit Decoupled Group Successive Over-Relaxation (EDG SOR) method was presented where the preconditioned scheme was shown to have a better rate of convergence compared to its unpreconditioned counterpart. In this paper, some new Fundamental theorems and lemmas related to the convergence properties of this preconditioned scheme will be established and presented.
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملOn the modification of the preconditioned AOR iterative method for linear system
In this paper, we will present a modification of the preconditioned AOR-type method for solving the linear system. A theorem is given to show the convergence rate of modification of the preconditioned AOR methods that can be enlarged than the convergence AOR method.
متن کامل